A Quasi-Nonblocking Self-Routing Network which Routs Packets in log2N Time
نویسندگان
چکیده
In this work a self-routing multi-logN permutation network is presented and studied. This network has log2 N depth and N(log 2 2 N + log2 N)/2 nodes, where N is the number of network inputs. Its parallel routing algorithm runs in log2 N time. The network architecture guarantees that only a negligeable quantity of information is blocked, while the quasi-totality of the information synchronously arrives in log2 N steps at the network outputs. Thanks to its distributed algorithm this network works in pipeline, furthermore it has a modular architecture suitable for very large N , it can be used as very high performance fast packet switching fabric and it is suitable for information exchange in very large scale multiprocessor systems.
منابع مشابه
A virtually nonblocking self - routing permutation network which routes packets in O ( log 2 N ) time
Asymptotically nonblocking networks are O(log2 N) depth self-routing permutation devices in which blocking probability vanishes when N (the number of network inputs) increases. This behavior does not guarantee, also for very large N , that all information always and simultaneously reaches its destination (and consequently that a whole permutation passes through the device) which is a requiremen...
متن کاملپروتکل مسیریابی خودتطبیقی با محدوده تأخیر برای شبکه های موردی بین خودرویی
Abstract Vehicular Ad Hoc Network (VANET) is a particular type of mobile ad hoc network in which vehicles communicate between themselves using wireless antenna. Due to unique characteristics of VANETs (e.g. high mobility of nodes and dynamic topology), routing is one of the challenging tasks in such networks. Consequently, delay tolerant networks which consider the disconnect nature of...
متن کاملA Rearrangeable Nonblocking Multi-log2N Multicast Switching Network
A new rearrangeable nonblocking photonic multilog network is introduced. It is shown that network simultaneously possesses many good properties, including those of existing rearrangeable nonblocking multinetworks and new ones such as -time fast parallel selfrouting and nonblocking multiple-multicast.
متن کاملSecuring AODV routing protocol against the black hole attack using Firefly algorithm
Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...
متن کاملA fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...
متن کامل